Algorithm on the convex hull of a simple polygon 简单多边形凸包的算法
The algorithm for convex hull set of plane finite point set 平面有限点集最小凸包集的计算方法
The convex hull of sbgb and subdivision algorithms are also discussed 此外,还讨论了sbgb曲线的包络及细分算法。
Absolute convex hulls 绝对凸包
And its convex hull 及其凸包
This article researches mostly on how to improve the convex hull algorithm of planar point set 本文的主要内容是对凸包的算法进行改进。
Instead of constructing a convex hull, we could construct a bounding box around the solid 如果不建立凸壳,我们可以在物体附近建立一个范围框。
An easy approach is to create a convex hull around an object's location at two different times 一条简单的途径就是在2不同的时间在一个物体的地点附近创造凸壳。
Abstract an improved image recognition and registration algorithm based on convex hull and affine invariant was presented 摘要提出了一种新的基于凸壳和仿射不变量的图像识别和配准的方法。
In this paper, application of convex hull is proposed to slove the problem of global tool interference avoidance in 5-axis sculptured surface machining 本文提出了运用凸包法解决在五轴加工中刀具干涉的算法。